Adaptive annealing for chaotic optimization
نویسندگان
چکیده
The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow chaotic annealing does not necessarily provide an optimum result. As an improved algorithm, the adaptive chaotic simulated annealing algorithm is introduced. Using several instances of 20and 40-city traveling salesman problems, efficiency of the adaptive algorithm is demonstrated. @S1063-651X~98!15510-1#
منابع مشابه
Chaotic Walk in Simulated Annealing Search Space for Task Allocation in a Multiprocessing System
This paper proposes the application of chaos in large search space problems, and suggests that this represents the next evolutionary step in the development of adaptive and intelligent systems towards cognitive machines and systems. Three different versions of chaotic simulated annealing (XSA) were applied to combinatorial optimization problems in multiprocessor task allocation. Chaotic walks i...
متن کاملParameter Estimation of Chaotic Dynamical Systems Using Quantum-behaved Particle Swarm Optimization Based on Hybrid Evolution
In this study, a quantum-behaved particle swarm optimization (QPSO) based on hybrid evolution (HEQPSO) approach is proposed to estimate parameters of chaotic dynamic systems, in which the proposed HEQPSO algorithm combines the conceptions of genetic algorithm (GA) and adaptive annealing learning algorithm with the QPSO algorithm. That is, the mutation strategy in GA is used for conquering prema...
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملAn Injection Rate Optimization in a Water Flooding Case Study with an Adaptive Simulated Annealing Techniques
This paper introduces an effective production optimization and a water injection allocation method for oil reservoirs with water injection. In this method, a two-stage adaptive simulated annealing (ASA) is used. A coarse-grid model is made based on average horizon permeability at the beginning iterations of the optimization to search quickly. In the second stage, the fine-grid model is used to ...
متن کاملSynchronization of a Heart Delay Model with Using CPSO Algorithm in Presence of Unknown Parameters
Heart chaotic system and the ability of particle swarm optimization (PSO) method motivated us to benefit the method of chaotic particle swarm optimization (CPSO) to synchronize the heart three-oscillator model. It can be a suitable algorithm for strengthening the controller in presence of unknown parameters. In this paper we apply adaptive control (AC) on heart delay model, also examine the sys...
متن کامل